Using Assumptions to Distribute CTL Model Checking
نویسندگان
چکیده
منابع مشابه
Using Assumptions to Distribute CTL Model Checking
In this work we discuss the problem of performing distributed CTL model checking by splitting the given state space into several “partial state spaces”. The partial state space is modelled as a Kripke structure with border states. Each computer involved in the distributed computation owns a partial state space and performs a model checking algorithm on this incomplete structure. To be able to p...
متن کاملModel Checking Ctl Is
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations—restrictions already studied for LTL by Sistla and Clarke (1985) and Markey (2004). For all these fragments, except for the trivial case without any temporal operator...
متن کاملReducing Model Checking from Multi-valued Ctl to Ctl
A multi-valued version of CTL (mv-CTL), where both the propositions and the accessibility relation are multi-valued taking values in a nite quasi-boolean algebra, is considered. A general translation from mv-CTL to CTL model checking is deened. An application of the translation is shown for the most commonly used quasi-boolean algebras.
متن کاملModel Checking Games for CTL
We define model checking games for the temporal logic CTL∗ and prove their correctness. They provide a technique for using model checking interactively in a verification/specification process. Their main feature is to construct paths in a transition system stepwise. That enables them to be the basis for a local model checking algorithm with a natural notion of justification. However, this requi...
متن کاملFirst-Order-CTL Model Checking
This work presents a first-order model checking procedure that verifies systems with potentially infinite data spaces with respect to first-order CTL specification. The procedure relies on a partition of the system variables into control and data. While control values are expanded into BDD-representations, data values enter in form of their properties relevant to the verification task. The algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2002
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80758-3